A Method for Improving Efficiency of Static Program Graph Scheduling
نویسندگان
چکیده
منابع مشابه
A Method for Improving Efficiency of Static Program Graph Scheduling
Obtaining maximum performance from parallel distributed memory machines depends on partitioning parallel programs into modules and scheduling those modules for the shortest possible execution time. The scheduling problem is known to be NP-hard and heuristic algorithms have been proposed to obtain optimal and sub optimal solutions. The partitioning algorithm partitions an application into tasks ...
متن کاملsemi-analytical solution for static and forced vibration problems of laminated beams through smooth fundamental functions method
در این پایان نامه روش جدیدی مبتنی بر روش حل معادلات دیفرانسیل پارهای بر اساس روش توابع پایه برای حل مسایل ارتعاش اجباری واستاتیک تیرها و صفحات لایه ای ارایه شده است که می توان تفاوت این روش با روش های متداول توابع پایه را در استفاده از توابع هموار در ارضاء معادلات حاکم و شرایط مرزی دانست. در روش ارایه شده در این پایاننامه از معادله تعادل به عنوان معادله حاکم بر رفتار سیستم استفاده شده است که مو...
15 صفحه اولImproving Spectrum Efficiency by Cognitive Radio Network Using Scheduling Method
Recent studies show that the fixed spectrum assignment policy enforced today results in poor spectrum utilization. To address this problem, the concept of cognitive radio is proposed to address the issue of spectrum efficiency and has been receiving an increasing attention in recent years, since it equips wireless users the capability to optimally adapt their operating parameters according to t...
متن کاملA Graph-Based Method for Improving GSAT
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satisfiability and constraint satisfaction problems. We present an improvement to GSAT that is sensitive to the problem’s structure. When the problem has a tree structure the algorithm is guaranteed to find a solution in linear time. For non-tree networks, the algorithm designates a subset of nodes,...
متن کاملEvaluation of static scheduling algorithms improved with partial strict triggering of program graph nodes
The problem of multiprocessor scheduling can be stated as finding a schedule for a general program graph to be executed on a multiprocessor system so that the schedule length can be minimised. This scheduling problem is known to be NP-hard and heuristic algorithms have been proposed to obtain optimal and sub optimal solutions. Almost all coarse grained program graph nodes dont need all of thei...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computing and Information Technology
سال: 2003
ISSN: 1330-1136,1846-3908
DOI: 10.2498/cit.2003.02.06